package com.longge;

public class FindLengthOfLCIS {
    public int findLengthOfLCIS(int[] nums) {

        int len = 1;
        int max = 1;

        for (int i = 0; i < nums.length-1; i++) {
            if (nums[i] < nums[i+1]) {
                len++;
                max = Math.max(len,max);
            }else if (nums[i]>=nums[i+1]){
                len = 1;
            }
        }
        return max;
    }
}
